The θ 5-Graph is a Spanner
نویسندگان
چکیده
Given a set of points in the plane, we show that the θ-graph with 5 cones is a geometric spanner with spanning ratio at most √ 50 + 22 √ 5 ≈ 9.960. This is the first constant upper bound on the spanning ratio of this graph. The upper bound uses a constructive argument that gives a (possibly self-intersecting) path between any two vertices, of length at most √ 50 + 22 √ 5 times the Euclidean distance between the vertices. We also give a lower bound on the spanning ratio of 1 2 (11 √ 5− 17) ≈ 3.798.
منابع مشابه
Stable Roommates Spanner
We introduce a new geometric spanner whose construction is based on a generalization of the known Stable Roommates problem. The Stable Roommates Spanner combines the most desirable properties of geometric spanners: a natural definition, small degree, linear number of edges, strong (1 + ε)-spanner for every > 0, and an efficient construction algorithm. It is an improvement over the well-known Ya...
متن کاملOn a Family of Strong Geometric Spanners That Admit Local Routing Strategies
We introduce a family of directed geometric graphs, denoted Gθλ, that depend on two parameters λ and θ. For 0 ≤ θ < π2 and 0 < λ < 1, the Gθλ graph is a strong t-spanner, with t = 1 (1−λ) cos θ . The out-degree of a node in the G θ λ graph is at most ⌈ 2π min(θ,arccosλ) ⌉. Moreover, we show that routing can be achieved locally on Gθλ. Next, we show that all strong t-spanners are also t-spanners...
متن کاملContinuous Yao Graphs
In this paper, we introduce a variation of the wellstudied Yao graphs. Given a set of points S ⊂ R and an angle 0 < θ ≤ 2π, we define the continuous Yao graph cY (θ) with vertex set S and angle θ as follows. For each p, q ∈ S, we add an edge from p to q in cY (θ) if there exists a cone with apex p and aperture θ such that q is the closest point to p inside this cone. We study the spanning ratio...
متن کاملAn Optimal Algorithm for Computing Angle-Constrained Spanners
Let S be a set of n points in Rd and let t > 1 be a real number. A graph G = (S,E) is called a t-spanner for S, if for any two points p and q in S, the shortest-path distance in G between p and q is at most t|pq|, where |pq| denotes the Euclidean distance between p and q. The graph G is called θ-angle-constrained, if any two distinct edges sharing an endpoint make an angle of at least θ. It is ...
متن کاملLocal Routing in Spanners Based on WSPDs
The well-separated pair decomposition (WSPD) of the complete Euclidean graph defined on points in R, introduced by Callahan and Kosaraju [JACM, 42 (1): 67-90, 1995], is a technique for partitioning the edges of the complete graph based on length into a linear number of sets. Among the many different applications of WSPDs, Callahan and Kosaraju proved that the sparse subgraph that results by sel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013